Diagonalizations of dense families
نویسندگان
چکیده
منابع مشابه
Almost disjoint families and diagonalizations of length continuum
We present a survey of some results and problems concerning constructions which require a diagonalization of length continuum to be carried out, particularly constructions of almost disjoint families of various sorts. We emphasize the role of cardinal invariants of the continuum and their combinatorial characterizations in such constructions. §
متن کاملGroupwise dense families
We show that the Filter Dichotomy Principle implies that there are exactly four classes of ideals in the set of increasing functions from the natural numbers. We thus answer two open questions on consequences of < . We show that < implies that = , and that Filter Dichotomy together with < implies < . The technical means is the investigation of groupwise dense sets, ideals, filters and ultrafilt...
متن کاملDense and Non-Dense Families of Complexity Classes
Let t be any abstract measure of computational complexity, and let L denote the specific measure of memory resource (tape) on one tape Turing machines. De~ote by R:() the class of all total functions whose t-complexity is bounded by the function t() almost everywhere. Call such classes t-complexity classes. We are interested in relationships among these classes, under proper set inclusion (C). ...
متن کاملAdditivity properties of topological diagonalizations
In a work of Just, Miller, Scheepers and Szeptycki it was asked whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions. In a recent work, Scheepers proved that one of the properties in question is closed under taking countable unions. After surveying the known results, we show that none of the remaining classes is prov...
متن کاملChromaticity of some families of dense graphs
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of G. If [G]={G}, then G is said to be chromatically unique. In this paper, we 4rst determine [G] for each graph G whose complement 5 G is of the form aK1∪bK3∪⋃16i6s Pli , where a; b are any nonnegative integers and li is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2014
ISSN: 0166-8641
DOI: 10.1016/j.topol.2014.01.001